Tensor Products and Powerspaces in Quantitative Domain Theory
نویسندگان
چکیده
منابع مشابه
Tensor Products and Higher Auslander-reiten Theory
Article history: Received 8 July 2015 Received in revised form 22 February 2016 Available online 4 August 2016 Communicated by S. Koenig We investigate how the higher almost split sequences over a tensor product of algebras are related to those over each factor. Herschend and Iyama give in [6] a criterion for when the tensor product of an n-representation finite algebra and an m-representation ...
متن کاملFuzzy projective modules and tensor products in fuzzy module categories
Let $R$ be a commutative ring. We write $mbox{Hom}(mu_A, nu_B)$ for the set of all fuzzy $R$-morphisms from $mu_A$ to $nu_B$, where $mu_A$ and $nu_B$ are two fuzzy $R$-modules. We make$mbox{Hom}(mu_A, nu_B)$ into fuzzy $R$-module by redefining a function $alpha:mbox{Hom}(mu_A, nu_B)longrightarrow [0,1]$. We study the properties of the functor $mbox{Hom}(mu_A,-):FRmbox{-Mod}rightarrow FRmbox{-Mo...
متن کاملbivariations and tensor products
the ordinary tensor product of modules is defined using bilinear maps (bimorphisms), that are linear in eachcomponent. keeping this in mind, linton and banaschewski with nelson defined and studied the tensor product in an equational category and in a general (concrete) category k, respectively, using bimorphisms, that is, defined via the hom-functor on k. also, the so-called sesquilinear, or on...
متن کاملOn Some Duality Relations in the Theory of Tensor Products
We study several classical duality results in the theory of tensor products, due mostly to Grothendieck, providing new proofs as well as new results. In particular, we show that the canonical mapping Y ∗ ⊗π X → (L(X, Y ), τ)∗ is not always injective, answering a problem of Defant and Floret. We use the machinery of vector measures to give new proofs of the dualitites (X⊗ε Y )∗ = N (X, Y ∗), whe...
متن کاملOn Some Constructions in Quantitative Domain Theory
Domains introduced by Dana Scott [11] and independently by Yuri L. Ershov [3] are a structure modelling the notion of approximation and of computation. A computation performed using an algorithm proceeds in discrete steps. After each step there is more information available about the result of the computation. In this way the result obtained after each step can be seen as an approximation of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80150-1